Base station scheduling of requests with fixed deadlines
نویسندگان
چکیده
We consider a packet switched wireless network in which a base station serves the mobiles. The packets for the mobiles arrive at the base station and have to be scheduled for transmission to the mobiles. The capacity of the channel from the base station to the mobiles is varying with time due to fading. We assume the mobiles can obtain different types of service based on the prices they are willing to pay. The objective of the base station is to schedule packets for transmission to mobiles to maximize the revenue earned. Our main result is that a simple greedy algorithm does at least as good as the optimal offline algorithm that knows the complete future request pattern and channel conditions. We also show that no other online algorithm can do better.
منابع مشابه
Scheduling Aperiodic Requests under the Rate-Based Execution Model
Aperiodic requests with unknown execution times and unknown arrival patterns are dynamically mapped to ratebased execution (RBE) tasks with variable rates and scheduled such that the real-time tasks are guaranteed to meet their deadlines. The aperiodic requests dynamically share the available processor capacity without reserving a fixed processor capacity for any one aperiodic request (or class...
متن کاملDeadline-Aware Energy-Efficient Query Scheduling in Wireless Sensor Networks with Mobile Sink
Mobile sinks are proposed to save sensor energy spent for multihop communication in transferring data to a base station (sink) in Wireless Sensor Networks. Due to relative low speed of mobile sinks, these approaches are mostly suitable for delay-tolerant applications. In this paper, we study the design of a query scheduling algorithm for query-based data gathering applications using mobile sink...
متن کاملDistance Constrained Tasks
Scheduling problems that involve distance constraint tasks with repetitive requests is becoming increasingly popular in real time systems. Timing constraints defined by periods of fixed lengths for each task enforce some frequency of task execution. Alternatively deadlines could be specified relatively to the finish time of the previous execution of the same task. Hence the scheduling algorithm...
متن کاملExploiting Skips In Periodic Tasks For Enhancing
In certain real-time applications, ranging from multimedia to telecommunication systems , timing constraints can be more exible than scheduling theory usually permits. For example, in video reception, missing a deadline is acceptable, provided that most deadlines are met. In this paper, we deal with the problem of scheduling hybrid sets of tasks, consisting of rm periodic tasks (i.e., tasks wit...
متن کاملOn-demand Bounded Broadcast Scheduling with Tight Deadlines
We investigate a scheduling problem motivated by pull-based data delivering systems where there is a server keeping a number of pages; and clients requesting the same page can be satisfied simultaneously by one broadcast. The HEU algorithm of Woeginger (1994) is proven to be optimal in maximizing the number of satisfied requests when the pages have equal length and the requests have tight deadl...
متن کامل